منابع مشابه
On density of subgraphs of halved cubes
Let S be a family of subsets of a set X of cardinality m and VC-dim(S) be the Vapnik-Chervonenkis dimension of S. Haussler, Littlestone, and Warmuth (Inf. Comput., 1994) proved that if G1(S) = (V,E) is the subgraph of the hypercube Qm induced by S (called the 1-inclusion graph of S), then |E| |V | ≤ VC-dim(S). Haussler (J. Combin. Th. A, 1995) presented an elegant proof of this inequality using...
متن کاملOn the k-subgraphs of the Generalized n-cubes
Graphs are used in modeling interconnections networks and measuring their properties. Knowing and understanding the graph theoretical/combinatorial properties of the underlying networks are necessary in developing more efficient parallel algorithms as well as fault-tolerant communication/routing algorithms [1] The hypercube is one of the most versatile and efficient networks yet discovered for ...
متن کاملLarge components in random induced subgraphs of n-cubes
In this paper we study random induced subgraphs of the binary n-cube, Q2 . This random graph is obtained by selecting each Q2 -vertex with independent probability λn. Using a novel construction of subcomponents we study the largest component for λn = 1+χn n , where ǫ ≥ χn ≥ n − 1 3 , δ > 0. We prove that there exists a.s. a unique largest component C (1) n . We furthermore show that χn = ǫ, |C ...
متن کاملDefective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency
We call a graph (m, k)-colorable if its vertices can be colored with m colors in such a way that each vertex is adjacent to at most k vertices of the same color as itself. For the class of planar graphs, and the class of outerplanar graphs, we determine all pairs (m, k) such that every graph in the class is ( m , k)-colorable. We include an elementary proof (not assuming the truth of the four-c...
متن کاملHyper-tubes of hyper-cubes
Hyper-tubes consisting of hyper-cubes of n-dimensions were designed and formulas for substructures of vary dimensions established.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1979
ISSN: 0012-365X
DOI: 10.1016/0012-365x(79)90112-2